Fast Sparse Level Sets on Graphics Hardware
نویسندگان
چکیده
منابع مشابه
Fast Regridding using LSQR on Graphics Hardware
Introduction: Iterative image reconstruction methods have become increasingly popular for parallel imaging or constrained reconstruction methods, but the main drawback is the long reconstruction time. In the case of nonCartesian imaging, resampling of k-space data between Cartesian and non-Cartesian grids has to be performed in each iteration step. Therefore the gridding procedure tends to be t...
متن کاملEvolutionary Computing on Consumer-Level Graphics Hardware
Evolutionary Algorithms (EAs) are effective and robust methods for solving many practical problems such as feature selection, electrical circuits synthesis, and data mining. However, they may execute for a long time for some difficult problems, because several fitness evaluations must be performed. A promising approach to overcome this limitation is to parallelize these algorithms. In this pape...
متن کاملContinuous Level of Detail on Graphics Hardware
Recent advances in graphics hardware provide new possibilities to successfully integrate and improve multiresolution models. In this paper, we present a new continuous multiresolution model that maintains its geometry, based on triangle strips, in high-performance memory in the GPU. This model manages the level of detail by performing fast strip updating operations. We show how this approach ta...
متن کاملFast Image Registration in Dx9 Graphics Hardware
The analysis of image time series requires a correlation of the information between two images. The gradient flow registration is a method for correlating this information by successively minimizing an appropriate energy along its gradient. A graphics hardware implementation of this approach to image registration is presented. The gradient flow formulation makes use of a robust multi-scale regu...
متن کاملFast Distance Field Computation Using Graphics Hardware
We present an algorithm for fast computation of discretized 3D distance fields using graphics hardware. Given a set of primitives and a distance metric, our algorithm computes the distance field for each slice of a uniform spatial grid by rasterizing the distance functions of the primitives. We compute bounds on the spatial extent of the Voronoi region of each primitive. These bounds are used t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2013
ISSN: 1077-2626
DOI: 10.1109/tvcg.2012.69